AALpy: an active automata learning library
نویسندگان
چکیده
Abstract AALpy is an extensible open-source Python library providing efficient implementations of active automata learning algorithms for deterministic, non-deterministic, and stochastic systems. We put a special focus on the conformance testing aspect in learning, as well intuitive seamlessly integrated interface characterizing real-world reactive In this article, we present ’s core functionalities, illustrate its usage via examples, evaluate performance. Finally, selected case studies models various types systems with .
منابع مشابه
Learning from Faults: Mutation Testing in Active Automata Learning - Mutation Testing in Active Automata Learning
System verification is often hindered by the absence of formal models. Peled et al. proposed black-box checking as a solution to this problem. This technique applies active automata learning to infer models of systems with unknown internal structure. This kind of learning relies on conformance testing to determine whether a learned model actually represents the considered system. Since conforma...
متن کاملLibrary classroom renovated as an active learning classroom
Several books and articles about learning space design have recently been published, giving much needed attention to new types of informal learning spaces such as the library commons. This article describes the redesign of a formal learning space: the general assignment classroom. In 2010, one of the University of Iowa’s Main Library classrooms was converted to an “active learning” space. The l...
متن کاملActive Learning in the Library Instruction Environment: An Exploratory Study
This paper describes an exploratory study investigating the impact of problem-based learning and clicker technology as active learning strategies at the American University of Sharjah Library, United Arab Emirates (UAE). Studies compared traditional and active learning classes. The present article maps the successes and challenges of these unique classroom encounters, and through correlation of...
متن کاملAn Abstract Framework for Counterexample Analysis in Active Automata Learning
Counterexample analysis has emerged as one of the key challenges in Angluin-style active automata learning. Rivest and Schapire (1993) showed for the L∗ algorithm that a single suffix of the counterexample was sufficient to ensure progress. This suffix can be obtained in a binary search fashion, requiring Θ(logm) membership queries for a counterexample of length m. Correctly implementing this a...
متن کاملAn Efficient Finite Tree Automata Library
Numerous computer systems use dynamic control and data structures of unbounded size. These data structures have often the character of trees or they can be encoded as trees with some additional pointers. This is exploited by some currently intensively studied techniques of formal verification that represent an infinite number of states using a finite tree automaton. However, currently there is ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Innovations in Systems and Software Engineering
سال: 2022
ISSN: ['1614-5054', '1614-5046']
DOI: https://doi.org/10.1007/s11334-022-00449-3